The growth of chronic conditions: Search for solutions to the problem

نویسنده

  • Dmitry Mednis
چکیده

The chronic conditions growth is determined by an increase of cases of adaptive system imbalance following a recent disease. One of its most significant causes is decrease of crisis importance (a stage of disease) as a moderator of a qualitative changeover of an adaptive system. The contemporary treatment methods increase efficiency of pre-crises adaptive responses, but simultaneously they equalize the crisis to a level, which is insufficient for complete after-crisis alignment of body defenses. But the crisis is the very key to a solution to a chronic conditions problem. One of the ways of the problem solving is medical interventions, which cause sparing provocation crisis and a successive changeover of an adaptive system. Based on this it is worth reviewing critically, studying and developing the existing experience of bio-regulatory therapy, where the principle of sparing provocation is often used. The new term definitions, such as "medical intervention", "health problems", "crisis" are described in terms of biomedicine. The patients and physicians should be motivated to deal with chronic conditions correction and the aforesaid sets new tasks before a health care system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method

In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...

متن کامل

A Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach (RESEARCH NOTE)

This paper proposes a novel, bi-objective mixed-integer mathematical programming for an open shop scheduling problem (OSSP) that minimizes the mean tardiness and the mean completion time. To obtain the efficient (Pareto-optimal) solutions, a fuzzy multi-objective decision making (fuzzy MODM) approach is applied. By the use of this approach, the related auxiliary single objective formulation can...

متن کامل

A Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version

Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...

متن کامل

A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM

The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...

متن کامل

Multi-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect

This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance.  First the problem is encoded with a...

متن کامل

Cuckoo search via Lévy flights for the capacitated vehicle routing problem

For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2017